Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem
We study the classical single machine scheduling problem but with uncertainty. A robust optimization model is presented, and an effective deep cut is derived. Numerical experiments show effectiveness of the derived cut.
متن کاملA Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times The basic formulation involves start time and sequence determining variables and lower bounds on the start times Its linear programming relaxation solves problems in which all release times are equal For the general p...
متن کاملSingle-machine Scheduling with Periodic Maintenance and both Preemptive and Non-preemptive jobs in Remanufacturing System
This paper considers a single-machine scheduling with preventive periodic maintenance activities in remanufacturing system. Although the scheduling problem with maintenance has attracted researchers’ attention, most of past studies consider only non-preemptive jobs. In fact, there exist both preemptive and non-preemptive jobs due to their different processing technic in remanufacturing workshop...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2015
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2015.52006